Chaotic Sand Cat Swarm Optimization

In this study, a new hybrid metaheuristic algorithm named Chaotic Sand Cat Swarm Optimization (CSCSO) is proposed for constrained and complex optimization problems. This algorithm combines the features of the recently introduced SCSO with the concept of chaos. The basic aim of the proposed algorithm is to integrate the chaos feature of non-recurring locations into SCSO’s core search process to improve global search performance and convergence behavior. Thus, randomness in SCSO can be replaced by a chaotic map due to similar randomness features with better statistical and dynamic properties. In addition to these advantages, low search consistency, local optimum trap, inefficiency search, and low population diversity issues are also provided. In the proposed CSCSO, several chaotic maps are implemented for more efficient behavior in the exploration and exploitation phases. Experiments are conducted on a wide variety of well-known test functions to increase the reliability of the results, as well as real-world problems. In this study, the proposed algorithm was applied to a total of 39 functions and multidisciplinary problems. It found 76.3% better responses compared to a best-developed SCSO variant and other chaotic-based metaheuristics tested. This extensive experiment indicates that the CSCSO algorithm excels in providing acceptable results

Generation of Automatic Six-Legged Walking Behavior Using Genetic Algorithms

Design and development of legged robots that can navigate effectively and autonomously in a wide range of environments is a challenging problem. At that point it should be noted that nature inspired optimization techniques have been widely studied for autonomous navigation of legged robots. In this study the framework constructed for six-legged walking behavior generation using genetic algorithms is presented and simulation results on Unity are discussed. © 2020 IEEE

Maximizing Coverage and Maintaining Connectivity in WSN and Decentralized Iot: An Efficient Metaheuristic-Based Method for Environment-Aware Node Deployment

The node deployment problem is a non-deterministic polynomial time (NP-hard). This study proposes a new and efficient method to solve this problem without the need for predefined circumstances about the environments independent of terrain. The proposed method is based on a metaheuristic algorithm and mimics the grey wolf optimizer (GWO) algorithm. In this study, we also suggested an enhanced version of the GWO algorithm to work adaptively in such problems and named it Mutant-GWO (MuGWO). Also, the suggested model ensures connectivity by generating topology graphs and potentially supports data transmission mechanisms. Therefore, the proposed method based on MuGWO can enhance resources utilization, such as reducing the number of nodes, by maximizing the coverage rate and maintaining the connectivity. While most studies assume classical rectangle uniform environments, this study also focuses on custom (environmentaware) maps in line with the importance and requirements of the real world. The motivation of supporting custom maps by this study is that environments can consist of custom shapes with prioritized and critical areas. In this way, environment awareness halts the deployment of nodes in undesired regions and averts resource waste. Besides, novel multi-purpose fitness functions of the proposed method satisfy a convenient approach to calculate costs instead of using complicated processes. Accordingly, this method is suitable for large-scale networks thanks to the capability of the distributed architecture and the metaheuristic-based approach. This study justifies the improvements in the suggested model by presenting comparisons with a Deterministic Grid-based approach and the Original GWO. Moreover, this method outperforms the fruit fly optimization algorithm, bat algorithm (BA), Optimized BA, harmony search, and improved dynamic deployment technique based on genetic algorithm methods in declared scenarios in literature, considering the results of simulations

Improved exploiting modification direction steganography for hexagonal image processing

Steganography has made significant advances in the Square-pixel-based Image Processing (SIP) domain, but to our knowledge, no work has yet been done in Hexel (Hexagonal Pixel)-based Image Processing (HIP). This paper presents a HIP-domain data hiding method that exploits and improves the SIP-domain Exploiting Modification Direction (EMD) embedding scheme. The proposed method, Hexagonal EMD (HexEMD), utilizes a HIP-domain cover image's hexagonal nature and infrastructure to embed the secret message. In standard digital imaging systems, the sensor portion that converts photonic energy into an analog electrical signal and all the subunits that digitize, process, and display this signal are based on square pixel logic, so there is currently no commercial equipment available to produce HIP-domain images. Thus, the image is first transformed into the HIP domain in software using the infrastructure developed in the project. Then the HIP-domain image is partitioned into non-overlapping heptads of the standard size, each containing seven hexels. Rather than embedding segments to the independent pixel pairs as done in SIP-domain EMD, we do the embedding iteratively in each heptad. Experimental results show that the HexEMD outperforms its SIP equivalent, EMD, by improving embedding capacity and achieving low visual quality distortion. © 2022 The Author

Application of Protein-Protein Interaction Network Analysis in Order to Identify Cervical Cancer miRNA and mRNA Biomarkers

Cervical cancer (CC) is one of the world’s most common and severe cancers. This cancer includes two histological types: squamous cell carcinoma (SCC) and adenocarcinoma (ADC). The current study aims at identifying novel potential candidate mRNA and miRNA biomarkers for SCC based on a protein-protein interaction (PPI) and miRNA-mRNA network analysis. The current project utilized a transcriptome profile for normal and SCC samples. First, the PPI network was constructed for the 1335 DEGs, and then, a significant gene module was extracted from the PPI network. Next, a list of miRNAs targeting module’s genes was collected from the experimentally validated databases, and a miRNA-mRNA regulatory network was formed. After network analysis, four driver genes were selected from the module’s genes including MCM2, MCM10, POLA1, and TONSL and introduced as potential candidate biomarkers for SCC. In addition, two hub miRNAs, including miR-193b-3p and miR-615-3p, were selected from the miRNA-mRNA regulatory network and reported as possible candidate biomarkers. In summary, six potential candidate RNA-based biomarkers consist of four genes containing MCM2, MCM10, POLA1, and TONSL, and two miRNAs containing miR-193b-3p and miR-615-3p are opposed as potential candidate biomarkers for CC

Phytochemical screening and antimicrobial activities of the constituents isolated from <i>Koelreuteria paniculata</i> leaves

<div><p>Methanolic extract of Golden rain leaves was fractionated by column chromatography on silica gel and 18 fractions were obtained. Antimicrobial activities of fractions were investigated against <i>Bacillus subtilis</i>, <i>Staphylococcus aureus</i>, <i>Escherichia coli</i> and <i>Pseudomonas aeruginosa</i> as quality control bacteria and fungus <i>Pyricularia grisea</i> which causes Blast disease in rice. Fractions showed more antibacterial activity at 0.04 g/mL concentration only on <i>B. subtilis</i> and <i>S. aureus</i> as gram positive bacteria. Also, three fractions indicated excellent antifungal effect on fungus <i>P. grisea</i>. Moreover, in the present study, fractions that showed very good effect on microorganisms were used for gas chromatography-mass spectrometry analysis to identify different phytochemicals.</p></div

RPINBASE: An online toolbox to extract features for predicting RNA-protein interactions

Feature extraction is one of the most important preprocessing steps in predicting the interactions between RNAs and proteins by applying machine learning approaches. Despite many efforts in this area, still, no suitable structural feature extraction tool has been designed. Therefore, an online toolbox, named RPINBASE which can be applied to different scopes of biological applications, is introduced in this paper. This toolbox employs efficient nested queries that enhance the speed of the requests and produces desired features in the form of positive and negative samples. To show the capabilities of the proposed toolbox, the developed toolbox was investigated in the aptamer design problem, and the obtained results are discussed. RPINBASE is an online toolbox and is accessible at http://rpinbase.com

Adaptive Metaheuristic-Based Methods for Autonomous Robot Path Planning: Sustainable Agricultural Applications

The increasing need for food in recent years means that environmental protection and sustainable agriculture are necessary. For this, smart agricultural systems and autonomous robots have become widespread. One of the most significant and persistent problems related to robots is 3D path planning, which is an NP-hard problem, for mobile robots. In this paper, efficient methods are proposed by two metaheuristic algorithms (Incremental Gray Wolf Optimization (I-GWO) and Expanded Gray Wolf Optimization (Ex-GWO)). The proposed methods try to find collision-free optimal paths between two points for robots without human intervention in an acceptable time with the lowest process costs and efficient use of resources in large-scale and crowded farmlands. Thanks to the methods proposed in this study, various tasks such as tracking crops can be performed efficiently by autonomous robots. The simulations are carried out using three methods, and the obtained results are compared with each other and analyzed. The relevant results show that in the proposed methods, the mobile robots avoid the obstacles successfully and obtain the optimal path cost from source to destination. According to the simulation results, the proposed method based on the Ex-GWO algorithm has a better success rate of 55.56% in optimal path cost

Adaptive Metaheuristic-Based Methods for Autonomous Robot Path Planning: Sustainable Agricultural Applications

© 2022 by the authors. Licensee MDPI, Basel, Switzerland.The increasing need for food in recent years means that environmental protection and sustainable agriculture are necessary. For this, smart agricultural systems and autonomous robots have become widespread. One of the most significant and persistent problems related to robots is 3D path planning, which is an NP-hard problem, for mobile robots. In this paper, efficient methods are proposed by two metaheuristic algorithms (Incremental Gray Wolf Optimization (I-GWO) and Expanded Gray Wolf Optimization (Ex-GWO)). The proposed methods try to find collision-free optimal paths between two points for robots without human intervention in an acceptable time with the lowest process costs and efficient use of resources in large-scale and crowded farmlands. Thanks to the methods proposed in this study, various tasks such as tracking crops can be performed efficiently by autonomous robots. The simulations are carried out using three methods, and the obtained results are compared with each other and analyzed. The relevant results show that in the proposed methods, the mobile robots avoid the obstacles successfully and obtain the optimal path cost from source to destination. According to the simulation results, the proposed method based on the Ex-GWO algorithm has a better success rate of 55.56% in optimal path cost